Hard and Easy Distributions of SAT Problems
نویسندگان
چکیده
We report results from large-scale experiments in satis-ability testing. As has been observed by others, testing the satissability of random formulas often appears surprisingly easy. Here we show that by using the right distribution of instances, and appropriate parameter values, it is possible to generate random formulas that are hard, that is, for which satissability testing is quite diicult. Our results provide a benchmark for the evaluation of satissability-testing procedures.
منابع مشابه
Investigating Computational Hardness through Realistic Boolean SAT Distributions
A fundamental question in Computer Science is understanding when a specific class of problems go from being computationally easy to hard. Because of its generality and applications, the problem of Boolean Satisfiability (aka SAT) is often used as a vehicle for these studies. A signal result from these studies is that the hardness of SAT problems exhibits a dramatic easy-to-hard phase transition...
متن کاملPhase Transition and Network Structure in Realistic SAT Problems
A fundamental question in Computer Science is understanding when a specific class of problems go from being computationally easy to hard. Because of its generality and applications, the problem of Boolean Satisfiability (aka SAT) is often used as a vehicle for investigating this question. A signal result from these studies is that the hardness of SAT problems exhibits a dramatic easy-to-hard ph...
متن کاملSAT distributions with planted assignments and phase transitions between decision and optimization problems
We present a generator for weighted instances of MAX k-SAT in which every clause has a weight associated with it and the goal is to maximize the total weight of satisfied clauses. Our generator produces formulas whose hardness can be finely tuned by two parameters p and δ that control the weights of the clauses. Under the right choice of these parameters an easy-hard-easy pattern in the search ...
متن کاملSAT Distributions with Phase Transitions between Decision and Optimization Problems
We present a generator for weighted instances of MAX k-SAT in which every clause has a weight associated with it and the goal is to maximize the total weight of satis ̄ed clauses. Our generator produces formulas whose hardness can be ̄nely tuned by two parameters p and ± that control the weights of the clauses. Under the right choice of these parameters an easy-hard-easy pattern in the search co...
متن کاملOn the Predictability of Classical Propositional Logic
In this work we provide a statistical form of empirical analysis of classical propositional logic decision methods called SAT solvers. This work is perceived as an empirical counterpart of a theoretical movement, called the enduring scandal of deduction, that opposes considering Boolean Logic as trivial in any sense. For that, we study the predictability of classical logic, which we take to be ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1992